Symbolic Computation: Computer Algebra and Logic 1 the next Goal for Symbolic Computation

نویسنده

  • Bruno Buchberger
چکیده

In this paper we present our personal view of what should be the next step in the development of symbolic computation systems. The main point is that future systems should integrate the power of algebra and logic. We identify four gaps between the future ideal and the systems available at present: the logic, the syntax , the mathematics, and the prover gap, respectively. We discuss higher order logic without extensionality and with set theory as a subtheory as a logic frame for future systems and we propose to start from existing computer algebra systems and proceed by adding new facilities for closing the syntax, mathematics, and the prover gaps. Mathematica seems to be a particularly suitable candidate for such an approach. As the main technique for structuring mathematical knowledge, mathematical methods (including algorithms), and also mathematical proofs, we underline the practical importance of functors and show how they can be naturally embedded into Mathematica. By the work of researchers in various areas, we now have powerful tools available that support various aspects of problem solving by computer:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

Computeralgebra on a Ksr1 Parallel Computer

1. Computer Algebra. Computer algebra software is concerned with exact and symbolic computation. E.g. with the computation of the following expressions. The computation of large numbers (e.g. 1000!), the expansion of polynomial expressions (e.g. (x+y)^20), the symbolic integration of functions (e.g. int(sin(x),x)) or the determination of all solutions to systems of algebraic equations (e.g. sol...

متن کامل

Symbolic Computation and Satisfiability Checking

The seminar focused on satisfiability checking for combinations of first-order logic and subclasses thereof with arithmetic theories in a very liberal sense, also covering quantifiers and parameters. It gathered members of the two communities of symbolic computation (or computer algebra) and satisfiability checking (including satisfiability modulo theories). Up-to-now, these two communities hav...

متن کامل

Making Computer Algebra More Symbolic

This paper is a step to bring closer together two views of computing with mathematical objects: the view of “symbolic computation” and the view of “computer algebra.” Symbolic computation may be seen as working with expression trees representing mathematical formulae and applying various rules to transform them. Computer algebra may be seen as developing constructive algorithms to compute algeb...

متن کامل

Logical Reasoning Systems

Logical Reasoning Systems derive sound conclusions from formal declarative knowledge. Such systems are usually deened by abstract rules of inference. For example, the rule of modus ponens states that given P , and \P implies Q" (usually written P ! Q), we can infer Q. Logical systems have a rich history starting with Greek syllogisms and continuing through the work many prominent mathematicians...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996